Engineering Self-Organizing Referral Networks for Trustworthy Service Selection
نویسندگان
چکیده
منابع مشابه
Collaboration reputation for trustworthy Web service selection in social networks
Traditional trustworthy service selection approaches focus the overall reputation maximization of all selected services in social networks. However, the selected services barely interact with each other in history, which leads to the trustworthiness among services very low. Hence, to enhance the trustworthiness of Web service selection, a novel concept, collaboration reputation is proposed in t...
متن کاملTools for Self-Organizing Applications Engineering
Nowadays, the applications to be realized are more often distributed, complex and open, e.g., applications on the Internet: information search, brokerage, e-commerce, e-business... Therefore, designers cannot implement a global control and list all situations such systems have to be faced with. ADELFE methodology was proposed to develop this kind of software. It is based on the AMAS theory (Ada...
متن کاملSoftware engineering for self-organizing systems
Self-organizing software systems are an increasingly attractive approach to highly distributed, decentralized, dynamic applications. In some domains (such as the Internet), the interaction of originally independent systems yields a self-organizing system de facto, and engineers must take these characteristics into account to manage them. This review surveys current work in this field and outlin...
متن کاملTopology Selection for Self-Organizing Maps
A topology-selection method for self-organizing maps (SOMs) based on empirical Bayesian inference is presented. This method is natural extension of the hyperparameter-selection method presented earlier, in which the SOM algorithm is regarded as an estimation algorithm for a Gaussian mixture model with a Gaussian smoothing prior on the centroid parameters, and optimal hyperparameters are obtaine...
متن کاملHyperparameter Selection for Self-Organizing Maps
The self-organizing map (SOM) algorithm for finite data is derived as an approximate MAP estimation algorithm for a Gaussian mixture model with a Gaussian smoothing prior, which is equivalent to a generalized deformable model (GDM). For this model, objective criteria for selecting hyperparameters are obtained on the basis of empirical Bayesian estimation and crossvalidation, which are represent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
سال: 2005
ISSN: 1083-4427
DOI: 10.1109/tsmca.2005.846401